New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body

نویسندگان

  • Adrian Dumitrescu
  • Csaba D. Tóth
چکیده

The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the plane, the average distance from the Fermat-Weber center of Q to the points of Q is larger than 16 · ∆(Q), where ∆(Q) is the diameter of Q. This proves a conjecture of Carmi, HarPeled and Katz. From the other direction, we prove that the same average distance is at most 2(4− √ 3) 13 ·∆(Q) < 0.3490 ·∆(Q). The new bound substantially improves the previous bound of 2 3 √ 3 ·∆(Q) ≈ 0.3849 ·∆(Q) due to Abu-Affash and Katz, and brings us closer to the conjectured value of 1 3 ·∆(Q). We also confirm the upper bound conjecture for centrally symmetric planar convex bodies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object

We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4∆(Q)/25, and at most 2∆(Q)/(3 √ 3), where ∆(Q) is the diameter of Q. We use the former bound to improve the approximation ratio of a load-balancing algorithm of Aronov et al. [2].

متن کامل

On the Fermat-Weber center of a convex object

We show that for any convex object Q in the plane, the average distance from the Fermat-Weber center of Q to the points in Q is at least ∆(P )/7, where ∆(P ) is the diameter of P , and that there exists a convex object for which this distance is ∆(P )/6. We use this result to obtain a linear-time approximation scheme for finding an approximate Fermat-Weber center of a convex polygon Q.

متن کامل

On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance

In this paper, we consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point to the continuously distributed customers along the boundary. A Weiszfeld-type procedure is proposed for this model, which is shown to be linea...

متن کامل

New bounds on proximity and remoteness in graphs

The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

متن کامل

ar X iv : c s . C G / 0 31 00 27 v 1 1 5 O ct 2 00 3 On the Continuous Fermat - Weber Problem ∗

We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the “continuous k-median (Fermat-Weber) problem” where the goal is to select one or more center points that minimize the average distance to a set of points in a demand region. In such problems, the average is computed a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Optimization

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2009